Thesis Overview: Reducing Branch Misprediction Penalty through Confidence Estimation

نویسندگان

  • Juan Luis Aragón
  • José González
  • Antonio González
چکیده

Control dependences are one of the major limitations to increase the performance of current processors. A branch instruction supposes an interruption of the sequential flow of instructions traversing the pipeline because the next instruction address is unknown until the branch is executed. However, the fetch stage should introduce the successor instruction following the branch as soon as possible in order to maximize processor performance. Control speculation is employed in order to achieve this goal, predicting the outcome of the branch, guessing the successor address and speculatively starting the execution of those instructions from the predicted path. But despite the important benefits provided by branch prediction schemes, there are many mispredicted branches. This means that the pipeline is filled with many wrong path instructions, being necessary flushing the pipeline and restoring the correct state of the processor.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Penalty-Sensitive Branch Predictor

Branch predictor design is typically focused only on minimizing the misprediction rate (MR), while ignores misprediction penalty.Because the misprediction penalty varies widely from branch to branch, performance might get improved by using a predictor that makes a greater effort to predict high-penalty branches, at the expense of the other, even if the total number of mispredictions doesn't cha...

متن کامل

Confidence Estimation for Branch Prediction Reversal

Branch prediction reversal has been proved to be an effective alternative approach to dropping misprediction rates by means of adding a Confidence Estimator to a correlating branch predictor. This paper presents a Branch Prediction Reversal Unit (BPRU) especially oriented to enhance correlating branch predictors, such as the gshare and the Alpha 21264 metapredictor. The novelty of this proposal...

متن کامل

BranchTap: Reducing Branch Misprediction Penalty through Speculation Control

Authors’ address: Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada. Authors’ emails: {pakl, moshovos}@eecg.toronto.edu Extension of Conference Paper: P. Akl and A. Moshovos, “BranchTap: Improving Performance with Very Few Checkpoints Through Adaptive Speculation Control”, Proceedings of the International Conference on Supercomputing (ICS’06), Cairns, Que...

متن کامل

Reducing the Effects of Branch Misprediction through Dynamic Heterogeneous Core Scheduling

The magnitude of a branch misprediction penalty is highly dependent on processor pipeline depth. Although longer pipelines may allow higher clock frequency, because less logic is performed in each stage, a fundamental trade-off exists between increased clock speed and accumulated misprediction penalties. Some programs, with easily predictable branches, will perform optimally on long pipelines. ...

متن کامل

Exploiting Criticality to Reduce Branch Misprediction Penalties

Conditional control instructions (branches) have long been a bottleneck for microprocessors. To overcome this bottleneck architects are now predicting the direction and target of branches. However, while years of research has led to increasing accuracy of branch prediction, the penalty of a branch misprediction has been increasing do to increasing pipeline depths. In this paper, we attempt to u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003